Martin Boundary of Killed Random Walks on Isoradial Graphs
نویسندگان
چکیده
We consider killed planar random walks on isoradial graphs. Contrary to the lattice case, graphs are not translation invariant, do admit any group structure and spatially non-homogeneous. Despite these crucial differences, we compute asymptotics of Martin kernel, deduce boundary show that it is minimal. Similar results grid $\mathbb {Z}^{d}$ derived in a celebrated work Ney Spitzer.
منابع مشابه
t-Martin boundary of killed random walks in the quadrant
We compute the t-Martin boundary of two-dimensional small steps random walks killed at the boundary of the quarter plane. We further provide explicit expressions for the (generating functions of the) discrete t-harmonic functions. Our approach is uniform in t, and shows that there are three regimes for the Martin boundary.
متن کاملMartin boundary theory of some quantum random walks
In this paper we define a general setting for Martin boundary theory associated to quantum random walks, and prove a representation theorem. We show that in the dual of a simply connected Lie subgroup of U(n), the extremal Martin boundary is homeomorphic to a sphere. Then, we investigate restriction of quantum random walks to Abelian subalgebras of group algebras, and establish a Ney–Spitzer th...
متن کاملMartin Boundaries and Random Walks
The first three sections give a quick overview of Martin boundary theory and state the main results. The succeeding sections will flesh out the details, and give proofs and examples. Virtually all of the results below are classical. The article Doob (1959) and the book by Kemeny, Snell, and Knapp (1976) are good sources for additional details. A recent survey article by Wolfgang Woess (1994) ha...
متن کاملRandom Walks on Random Graphs
The aim of this article is to discuss some of the notions and applications of random walks on finite graphs, especially as they apply to random graphs. In this section we give some basic definitions, in Section 2 we review applications of random walks in computer science, and in Section 3 we focus on walks in random graphs. Given a graphG = (V,E), let dG(v) denote the degree of vertex v for all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Potential Analysis
سال: 2021
ISSN: ['1572-929X', '0926-2601']
DOI: https://doi.org/10.1007/s11118-021-09912-5